Geometric Constraint Solving and Automated Geometric Reasoning (TRACK PROPOSAL TO SAC 2006, DIJON, FRANCE)
نویسندگان
چکیده
We propose to organize at SAC 2006 a track dedicated to the recent trends in the domain of geometric constraint solving (GCS) and automated, or computer aided, deduction in geometry (ADG). Geometric problems are within the heart of many theoretical studies and engineering applications. For instance a large amount of problems from geometric modeling, computer graphics, computer vision, computer aided design, and robotics could be reduced to either geometric constraint solving or geometric reasoning. Conversely, a wide range of methods based on very different approaches have been studied for solving geometric constraints and proving geometric theorems. This track will be an interesting opportunity to gather researchers coming from communities concerned by subjects as different as constraint programming, numeric analysis, symbolic computation, CAD, automated reasoning, and computer graphics. CR Categories: G.1.5 [Mathematics of Computing]: Numerical Analysis—Roots of Nonlinear Equation; G.4 [Mathematics of Computing]: Mathematical Software—; I.2.3 [Computing Methodologies]: Artificial Intelligence—Deduction and Theorem Proving; I.3.5 [Computing Methodologies]: Computer Graphics—Computational Geometry and Object Modeling; J.6.0 [Computer Application]: Computer-aided Engineering— Computer-aided Design (CAD); K.3.1 [Computing Milieux]: Computers and Education—Computer Uses in Education Computerassisted instruction (CAI);
منابع مشابه
A Systematic Framework for Solving Geometric Constraints Analytically
A systematic framework is presented for solving algebraic equations arising in geometric constraint solving. The framework has been used successfully to solve a family of spatial geometric constraint problems. The approach combines geometric reasoning, symbolic reduction, and homotopy continuation.
متن کاملGeometric Constraint Solving In
Geometric constraint solving has applications in a wide variety of elds, such as mechanical engineering, chemical molecular conformation, geometric theorem proving, and surveying. The problem consists of a given set of geometric elements and a description of geometric constraints between the elements. The goal is to nd all placements of the geometric entities which satisfy the given constraints...
متن کاملAutomated Geometric Reasoning : Dixon Resultants
Three diierent methods for automated geometry theorem proving|a generalized version of Dixon resultants, Grr obner bases and characteristic sets|are reviewed. The main focus is, however, on the use of the generalized Dixon resultant formulation for solving geometric problems and determining geometric quantities.
متن کاملSolving Space Planning Problems Using Constraint Technology
Constraint programming techniques have proven their eeciency in solving high combinatory problems. In this paper, we study the adaptation , the extension and the limits of those techniques in the space planning problem which consists in nding the locations and the sizes of several objects under geometric constraints in a location space. For all that, we deene the formalism of Geometric Constrai...
متن کاملCBAbench: An AutoCAD-based Dynamic Geometric Constraint System
In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. An...
متن کامل